Mesh Smoothing Algorithms for Complex Geometric Domains
نویسندگان
چکیده
Whenever a new mesh smoothing algorithm is introduced in the literature, initial experimental analysis is often performed on relatively simple geometric domains where the meshes need little or no element size grading. Here, we present a comparative study of a large number of well-known smoothing algorithms on triangulations of complex geometric domains. Our study reveals the limitations of some well-known smoothing methods. Specifically, the optimal Delaunay triangulation smoothing and weighted centroid of circumcenter smoothing methods are shown to have difficulty achieving smooth grading and adapting to complex domain boundary. We propose modifications and report significant improvements and behavior change in the performance of these algorithms. More importantly, we propose three new smoothing strategies and show their effectiveness in computing premium quality triangulations for complex geometric domains. While the proposed algorithms give the practitioners additional tools to chose from, our comparative study of over a dozen algorithms should guide them selecting the best smoothing method for their particular application.
منابع مشابه
On Combining Laplacian and Optimization-based Mesh Smoothing Techniques
Local mesh smoothing algorithms have been shown to be eeective in repairing distorted elements in automatically generated meshes. The simplest such algorithm is Laplacian smoothing , which moves grid points to the geometric center of incident vertices. Unfortunately, this method operates heuristically and can create invalid meshes or elements of worse quality than those contained in the origina...
متن کاملCurvature and Geodesics, Discrete Laplacian and related smoothing methods
Mesh smoothing is a method to remove noise or small scale features from large meshes, while still preserving the basic overall shape and important features of the original model. Most sophisticated smoothing methods rely on ideas from differential geometry. In this lecture we discuss some basic geometric concepts and introduce some simple smoothing algorithms; the paper presented at this lectur...
متن کاملEfficient and Global Optimization-Based Smoothing Methods for Mixed-Volume Meshes
Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a systematic approach to global optimization-based versions of such methods for mixed volume meshes, which generalizes to arbitrary dimensions. We also identify some a...
متن کاملGeometric fairing of irregular meshes for free-form surface design
In this paper we present a new algorithm for smoothing arbitrary triangle meshes while satisfying boundary conditions. The algorithm is based on solving a non-linear fourth order partial differential equation (PDE) that only depends on intrinsic surface properties instead of being derived from a particular surface parameterization. This continuous PDE has a (representation-independent) welldefi...
متن کاملParallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High quality and high density meshes are required to accurately capture the complex physical phenomena. A parallel framework has been developed to generate large-scale meshes in a short period of time. A coarse volume mesh is generated first to provide the basis of block interfaces and partitioned into a number of su...
متن کامل